Path Planning of Mobile Robots in Warehouse Logistics Relying on Computer Multimedia 3D Reconstruction Technology
نویسندگان
چکیده
Because traditional methods are difficult to solve the problems related path planning of logistics robots, this study proposes a method using computer multimedia 3D reconstruction technology realize warehouse robots. Without fully considering accurate movement between points, according robot, it is judged whether starting point at exit. The problem converted into TSP and TS-TSP problem. Finally, analysis experimental results shows that proposed in converges faster than algorithms can quickly obtain global optimal solution. At same time, warehousing robot requires less time has strong practical application.
منابع مشابه
3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملOn-line Path Planning for Mobile Robots in Dynamic Environments
Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...
متن کاملMultiresolution path planning for mobile robots
The problem of automatic collision-free path planning is central to mobile robot applications. An approach to automatic path planning based on a quadtree representation is presented. Hierarchical path-searching methods are introduced, which make use of this multireso-lution representation, to speed up the path planning process considerably. The applicability of this approach to mobile robot pat...
متن کاملCoverage Path Planning for Mobile Cleaning Robots
In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore a...
متن کاملMotion Path Planning for Mobile Robots
Potential field methods are rapidly gaining popularity in obstacle avoidance applications for mobile robots. The general principles of potential field path planning are presented first. The electrostatic potential field (EPF) path planner is then combined with a twolayered fuzzy logic inference engine and implemented for mobile robot navigation in a 2-D dynamic environment. The first layer of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in multimedia
سال: 2021
ISSN: ['1687-5680', '1687-5699']
DOI: https://doi.org/10.1155/2021/4090990